Michael Rusinowitch And NotFranche-Comté
List of bibliographic references
Number of relevant bibliographic references: 74.| Ident. | Authors (with country if any) | Title |
|---|---|---|
| 000061 | Mathieu Turuani [France] ; Thomas Voegtlin [France] ; Michael Rusinowitch [France] | Automated Verification of Electrum Wallet |
| 000780 | Frédéric Dadeau [France] ; Pierre-Cyrille Héam [France] ; Rafik Kheddam [France] ; Ghazi Maatoug [France] ; Michael Rusinowitch [France] | Model‐based mutation testing from security protocols in HLPSL |
| 001499 | Florent Jacquemard [France] ; Michael Rusinowitch [France] | Rewrite Closure and CF Hedge Automata |
| 003002 | Siva Anantharaman [France] ; Hai Lin [États-Unis] ; Christopher Lynch [États-Unis] ; Paliath Narendran [États-Unis] ; Michael Rusinowitch [France] | Unification Modulo Homomorphic Encryption |
| 003169 | Yannick Chevalier [France] ; Michael Rusinowitch [France] | Symbolic protocol analysis in the union of disjoint intruder theories: Combining decision procedures |
| 004412 | Florent Jacquemard [France] ; Michael Rusinowitch [France] | Closure of Hedge-Automata Languages by Hedge Rewriting |
| 004460 | Yannick Chevalier [France] ; Michael Rusinowitch [France] | Hierarchical combination of intruder theories |
| 004C40 | Siva Anantharaman [France] ; Paliath Narendran [États-Unis] ; Michael Rusinowitch [France] | Intruders with Caps |
| 005355 | Florent Jacquemard [France] ; Michael Rusinowitch [France] ; Laurent Vigneron [France] | Tree Automata with Equality Constraints Modulo Equational Theories |
| 005586 | Florent Jacquemard [France] ; Michael Rusinowitch [France] ; Laurent Vigneron [France] | Tree automata with equality constraints modulo equational theories |
| 005D26 | Véronique Cortier ; Michael Rusinowitch ; Eugen Zalinescu | A resolution Strategy for Verifying Cryptographic Protocols with CBC Encryption and Blind Signatures |
| 005F15 | Florent Jacquemard ; Michael Rusinowitch ; Laurent Vigneron | Tree Automata with Equality Constraints Modulo Equational Theories |
| 006376 | Siva Anantharaman [France] ; Paliath Narendran [États-Unis] ; Michael Rusinowitch [France] | Closure properties and decision problems of dag automata |
| 006840 | Tarek Abbes ; Adel Bouhoula ; Michael Rusinowitch | On the Fly Pattern Matching For Intrusion Detection with Snort |
| 006845 | Tarek Abbes ; Adel Bouhoula ; Michael Rusinowitch | Protocol Analysis in Intrusion Detection Using Decision Tree |
| 006847 | Yannick Chevalier ; Ralf Küesters ; Michael Rusinowitch ; Mathieu Turuani | Deciding the Security of Protocols with Commuting Public Key Encryption. |
| 006871 | Tarek Abbes ; Alakesh Haloi ; Michael Rusinowitch | High Performance Intrusion Detection using Traffic Classification |
| 006917 | Tarek Abbes ; Michael Rusinowitch | Fast Multipattern Matching for Intrusion Detection |
| 006925 | Tarek Abbes ; Michael Rusinowitch ; Alakesh Haloi | Network Traffic Classification for Intrusion Detection |
| 006945 | Siva Anantharaman ; Paliath Narendran ; Michael Rusinowitch | Unification Modulo ACUI Plus Distributivity Axioms |
| 006A36 | Michael Rusinowitch | A Decidable Analysis of Security Protocols |
| 006B10 | Siva Anantharaman [France] ; Paliath Narendran [États-Unis] ; Michael Rusinowitch [France] | Unification Modulo ACUI Plus Distributivity Axioms |
| 006B57 | Tarek Abbes [France] ; Adel Bouhoula [Tunisie] ; Michael Rusinowitch [France] | On the fly pattern matching for intrusion detection with Snort |
| 007366 | Hubert Comon ; Paliath Narendran ; Robert Nieuwenhuis ; Michael Rusinowitch | Deciding the Confluence of Ordered Term Rewrite Systems |
| 007663 | Yannick Chevalier ; Ralf Kuester ; Michael Rusinowitch ; Mathieu Turuani ; Laurent Vigneron | Extending the Dolev-Yao Intruder for Analyzing an Unbounded Number of Sessions |
| 007861 | Tarek Abbes ; Adel Bouhoula ; Michael Rusinowitch | Filtrage Efficace Pour la Détection d'Intrusions |
| 007969 | Siva Anantharaman [France] ; Paliath Narendran [États-Unis] ; Michael Rusinowitch [France] | Unification Modulo ACUI Plus Homomorphisms/Distributivity |
| 007B04 | Siva Anantharaman [France] ; Paliath Narendran [États-Unis] ; Michael Rusinowitch [France] | ACID -Unification Is NEXPTIME-Decidable |
| 008594 | Alessandro Armando ; David Basin ; Mehdi Bouallagui ; Yannick Chevalier ; Luca Compagna ; Sebastian Moedersheim ; Michael Rusinowitch ; Mathieu Turuani ; Luca Vigano ; Laurent Vigneron | The AVISS Security Protocol Analysis Tool |
| 008609 | Adel Bouhoula ; Michael Rusinowitch | Observational proofs by rewriting |
| 008734 | Alessandro Armando [Italie] ; David Basin [Allemagne] ; Mehdi Bouallagui [France] ; Yannick Chevalier [France] ; Luca Compagna [Italie] ; Sebastian Mödersheim [Allemagne] ; Michael Rusinowitch [France] ; Mathieu Turuani [France] ; Luca Vigan [Allemagne] ; Laurent Vigneron [France] | The AVISS Security Protocol Analysis Tool |
| 008E02 | Michael Rusinowitch | Vérification et réécriture |
| 008E35 | Michael Rusinowitch | Vérification automatique de protocoles cryptographiques avec CASRUL |
| 008F49 | Alessandro Armando ; Michael Rusinowitch ; Sorin Stratulat | Incorporating Decision Procedures in Implicit Induction |
| 008F50 | Alessandro Armando ; Michael Rusinowitch ; Sorin Stratulat | Incorporating Decision Procedures in Implicit Induction |
| 008F83 | Michael Rusinowitch | Rewriting for Deduction and Verification |
| 009031 | Michael Rusinowitch | Uniform Derivation of Satisfiability Procedures |
| 009033 | Michael Rusinowitch | The practice of cryptographic protocols verification |
| 009040 | Alessandro Armando ; Silvio Ranise ; Michael Rusinowitch | Uniform Derivation of Decision Procedures by Superposition |
| 009049 | Michael Rusinowitch ; Mathieu Turuani | Deciding insecurity for non-atomic keys |
| 009067 | Julien Musset ; Michael Rusinowitch | An effective fixed point calculus for deterministic systems applied to model checking |
| 009078 | Rakesh Verma ; Michael Rusinowitch ; Denis Lugiez | Algorithms and Reductions for Rewriting Problems |
| 009105 | Michael Rusinowitch ; Mathieu Turuani | Protocol Insecurity with Finite Number of Sessions is NP-complete |
| 009106 | Julien Musset ; Michael Rusinowitch | Improved Subsumption for CLP-based Verification |
| 009293 | Michael Rusinowitch [France] | Rewriting for Deduction and Verification |
| 009986 | Paliath Narendran ; Michael Rusinowitch | The theory of total unary RPO is decidable |
| 009997 | Michael Rusinowitch ; Sorin Stratulat ; Francis Klay | Mechanical Verification of an Ideal Incremental ABR Conformance Algorithm |
| 009B07 | Florent Jacquemard ; Michael Rusinowitch ; Laurent Vigneron | Compiling and Verifying Security Protocols |
| 009E14 | Paliath Narendran [États-Unis] ; Michael Rusinowitch [France] | The Theory of Total Unary RPO Is Decidable |
| 00A438 | Gregory Kucherov ; Michael Rusinowitch | Patterns in words versus patterns in trees : a brief survey and new results |
| 00A533 | Michael Rusinowitch ; Sorin Stratulat ; Francis Klay | Mechanical Verification of a Generic Incremental ABR Conformance Algorithm |
| 00A580 | Florent Jacquemard ; Michael Rusinowitch ; Laurent Vigneron | Compiling and narrowing cryptographic protocols |
| 00A642 | Francis Klay ; Michael Rusinowitch ; Sorin Stratulat | Analysing Feature Interactions with Automated Deduction Systems |
| 00A696 | Adel Bouhoula ; Ahmed Jebali ; Michael Rusinowitch | Reasoning about Object Behaviours with Rewriting. |
| 00A764 | Paliath Narendran ; Michael Rusinowitch | Rewriting Techniques and Applications |
| 00A782 | Alessandro Armando ; Gilles Defourneaux ; Michael Rusinowitch ; Sorin Stratulat | Integrating decision procedures in Spike |
| 00A946 | Paliath Narendran [États-Unis] ; Michael Rusinowitch [France] ; Rakesh Verma [États-Unis] | RPO Constraint Solving Is in NP |
| 00AE71 | Richard Mayr ; Michael Rusinowitch | Reachability is decidable for ground AC Rewrite systems |
| 00B039 | Francis Klay ; Michael Rusinowitch ; Sorin Stratulat | Analysing Feature Interactions with Automated Deduction Systems |
| 00B070 | Paliath Narendran ; Michael Rusinowitch ; Rakesh Verma | RPO constraint solving is in NP |
| 00B071 | Paliath Narendran ; Michael Rusinowitch ; Rakesh Verma | RPO constraint solving is in NP |
| 00B108 | Rakesh Verma ; Michael Rusinowitch ; Denis Lugiez | Algorithms and Reductions for Rewriting Problems |
| 00B196 | Hubert Comon ; Paliath Narendran ; Robert Nieuwenhuis ; Michael Rusinowitch | Decision problems in ordered rewriting |
| 00B968 | Gregory Kucherov ; Michael Rusinowitch | Matching a Set of Strings with Variable Length Don't Cares |
| 00BA89 | Hubert Comon ; Paliath Narendran ; Michael Rusinowitch | Decision Problems in Ordered Rewriting |
| 00BA98 | Rakesh Verma ; Michael Rusinowitch ; Denis Lugiez | Algorithms and Reductions for Rewrite Problems |
| 00C396 | Gregory Kucherov ; Michael Rusinowitch | Matching a Set of Strings with Variable Length Don't Cares |
| 00C468 | Michael Rusinowitch ; Laurent Vigneron | Automated Deduction with Associative Commutative Operators |
| 00D906 | Michael Rusinowitch ; Laurent Vigneron | Automated Deduction with Associative Commutative Operators |
| 00E344 | Emmanuel Kounalis [France] ; Michael Rusinowitch [France] | On word problems in Horn theories |
| 00E555 | Michael Rusinowitch [France] | On termination of the direct sum of term-rewriting systems |
| 00E606 | Jieh Hsiang [États-Unis] ; Michael Rusinowitch [France] | On word problems in equational theories |
| 00E860 | Jieh Hsiang [États-Unis] ; Michael Rusinowitch [France] | A new method for establishing refutational completeness in theorem proving |
| 00EA39 | Michael Rusinowitch [France] | Path of subterms ordering and recursive decomposition ordering revisited |
| This area was generated with Dilib version V0.6.33. |  |